Independent Vector Analysis via Log-Quadratically Penalized Quadratic Minimization
نویسندگان
چکیده
We propose a new algorithm for blind source separation (BSS) using independent vector analysis (IVA). This is an improvement over the popular auxiliary function based IVA (AuxIVA) with iterative projection (IP) or steering (ISS). introduce adjustment (IPA), where we update one demixing filter and jointly adjust all other sources along its current direction. Each involves solving non-convex minimization problem that term log-quadratically penalized quadratic (LQPQM), think of interest beyond this work. In general case, show global minimum corresponds to largest root univariate function, reminiscent modified eigenvalue problems. simple procedure on Newton-Raphson efficiently compute it. Numerical experiments demonstrate effectiveness proposed method. First, it decreases value surrogate function. further synthetic mixtures, study probability finding true matrix convergence speed. method combines high success rate fast convergence. Finally, validate performance reverberant speech task. find AuxIVA-based methods perform similarly in terms acoustic BSS metrics. However, AuxIVA-IPA converges faster. measure up 8.5 times speed-up runtime compared next best method, depending number channels signal-to-noise ratio (SNR).
منابع مشابه
Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences
The accuracy of the solution to P(XN ) is dependent on the choice of the points XN . Choosing random points can lead to arbitrary bad solutions. To get an accurate solution we resort to optimally mapping a low-discrepancy sequence to the ellipsoidal constraint, which has good equidistribution property. We use a (t,m, s)-net as a starting point on the unit hypercube which is then mapped to the s...
متن کاملl-Penalized Minimization Problems
Most of the inverse problems arising in applied electromagnetics come from an underdetermined direct problem, this is the case, for instance, of spatial resolution enhancement. This implies that no unique inverse operator exists; therefore, additional constraints must be imposed on the sought solution. When dealing with microwave remote sensing, among the possible choices, the minimum p–norm co...
متن کاملA Quadratically Constrained Fractional Quadratic Programming Approach for Dilution of Precision Minimization
An approach to find the global optimal solution of the dilution of precision (DOP) problem is presented. The DOP optimization problem considered assumes an environment comprising multiple randomly pre-deployed sensors (or navigation sources) and an additional sensor is to be introduced at the location that minimizes variations of the DOP problem (e.g., weighted geometric DOP (WGDOP), horizontal...
متن کاملQuadratic independent component analysis
The transformation of a data set using a second-order polynomial mapping to find statistically independent components is considered (quadratic independent component analysis or ICA). Based on overdetermined linear ICA, an algorithm together with separability conditions are given via linearization reduction. The linearization is achieved using a higher dimensional embedding defined by the linear...
متن کاملConvex quadratic relaxations of nonconvex quadratically constrained quadratic programs
Nonconvex quadratic constraints can be linearized to obtain relaxations in a wellunderstood manner. We propose to tighten the relaxation by using second order cone constraints, resulting in a convex quadratic relaxation. Our quadratic approximation to the bilinear term is compared to the linear McCormick bounds. The second order cone constraints are based on linear combinations of pairs of vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2021
ISSN: ['1053-587X', '1941-0476']
DOI: https://doi.org/10.1109/tsp.2021.3072228